Optimal All-to-All Personalized Exchange in a Class of Optical Multistage Networks
نویسندگان
چکیده
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper, we look into the issue of realizing all-to-all personalized exchange in optical multistage networks. Advances in electro-optic technologies have made optical communication a promising networking choice to meet the increasing demands for high channel bandwidth and low communication latency of high-performance computing/communication applications. Although optical multistage networks hold great promise and have demonstrated advantages over their electronic counterpart, they also hold their own challenges. Due to the unique properties of optics, crosstalk in optical switches should be avoided to make them work properly. In this paper, we will provide an optimal scheme for realizing all-to-all personalized exchange in a class of unique-path, selfrouting optical multistage networks crosstalk-free. The basic idea of realizing all-to-all personalized exchange in such a multistage network is to transform it to multiple semi-permutations, each of which can be realized crosstalk-free in a single pass, and take advantage of pipelined message transmission in consecutive passes. As can be seen, the time complexity of our all-to-all personalized exchange algorithms matches the lower bound of the communication delay in this type of network.
منابع مشابه
Ëëòóðó ×××××ûò ½ Ëøñóóðð Ôöó ³ ××××× ½ Ööø Ð Ø Øùù ××òòò×× Ôóù Õóùò Ôöóø Ññøø Øó ¾¼¼¼º
An optical multistage interconnection network for optimal all-to-all personalized exchange, They propose an optical multistage interconnection network to realize an all-to-all personalized exchange that only requires one pass to send a message from each node to a different node (to realize a permutation). Hence, the new optical multistage interconnection network only requires n-1 passes for an ...
متن کاملOptimal All-to-All Personalized Exchange in Self-Routable Multistage Networks
ÐAll-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important applications in parallel computing. Previous all-to-all personalized exchange algorithms were mainly developed for hypercube and mesh/torus networks. Although the algorithms for a hypercube may achieve optimal time complexity, the network suffers from unbounded node degrees ...
متن کاملOptimal all-to-all personalized exchange in d -nary banyan multistage interconnection networks
All-to-all personalized exchange occurs in many important applications in parallel processing. In the past two decades, algorithms for all-to-all personalized exchange were mainly proposed for hypercubes, meshes, and tori. Recently, Yang and Wang (IEEE Trans Parallel Distrib Syst 11:261–274, 2000) proposed an optimal all-to-all personalized exchange algorithm for binary (each switch is of size ...
متن کاملOptimal All-to-All Personalized Exchange by Regularly Changing Switch States in Self-Routable Multistage Networks
Abstract-We find the permutation routing algorithm proposed by Lai [3] is closely related to the personalized exchange algorithm investigated by Yang and Wang [1] previously. Inspired by the idea of Lai, we modified Yang et al’s the personalized exchange algorithm in a pipelined version, and present a new switching pattern for reducing the changing speed of switching states by a half.
متن کاملAll-to-all Personalized Communication on Multistage Interconnection Networks
In parallel/distributed computing systems, the all-to-all personalized communication (or complete exchange) is required in numerous applications of parallel processing. In this paper, we consider this problem for logN stage Multistage Interconnection Networks (MINs). It is proved that the set of admissible permutations for a MIN can be partitioned in Latin Squares. Since routing permutations be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Parallel Distrib. Syst.
دوره 12 شماره
صفحات -
تاریخ انتشار 2000